Decomposition Lemmas
نویسندگان
چکیده
We define the following recursive function T (n): T (0) = 0 T (1) = 0 T (2) = 1 T (n) = T n 2 + T n 2 + 1 + T n 2 − 1 + T n 2 + 1 (1.1) (n ≥ 3).
منابع مشابه
On Roussel-Rubio-type lemmas and their consequences
Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward’s decomposition theorem for weakly chordal graphs, relying on a Roussel–Rubio-type lemma. We recall how Roussel–Rubio-type lemmas yield very short proofs of the existence of even pairs ...
متن کاملGenerating Lemmas for Tableau-based Proof Search Using Genetic Programming
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successful technique for alleviating these shortcomings is the use of lemmas. We propose to use genetic programming to evolve useful lemmas through an interleaved process of top-down goal decomposition and bottomup lemma genera...
متن کاملLemma Generation for Model Elimination by Combining Top-Down and Bottom-Up Inference
A very promising approach for integrating topdown and bottom-up proof search is the use of bottom-up generated lemmas in top-down provers. When generating lemmas, however) the currently used lemma generation procedures suffer from the well-known problems of forward reasoning methods, e.g., the proof goal is ignored. In order to overcome these problems we propose two relevancy-based lemma genera...
متن کاملA Sharp Form of Whitney’s Extension Theorem
0. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .2 1. Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. Statement of Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3. Order Relations Involving Multi–indices . . . . . . . ....
متن کاملRegularity in kinetic formulations via averaging lemmas
We present a new class of averaging lemmas directly motivated by the question of regularity for different nonlinear equations or variational problems which admit a kinetic formulation. In particular they improve the known regularity for systems like γ = 3 in isentropic gas dynamics or in some variational problems arising in thin micromagnetic films. They also allow to obtain directly the best k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1306.1857 شماره
صفحات -
تاریخ انتشار 2013